Deterministic time-varying packet fair queueing for integrated services networks
نویسندگان
چکیده
In integrated services networks, the provision of Quality of Service (QoS) guarantees depends critically upon the scheduling algorithm employed at the network layer. In this work we review fundamental results on scheduling, and we focus on Packet Fair Queueing (PFQ) algorithms, which have been proposed for QoS wirelinewireless networking. The basic notion in PFQ is that the bandwidth allocated to a session is proportional to a positive weight φi . Because of the fixed weight assignment, the inherent in PFQ delay-bandwidth coupling imposes limitations on the range of QoS that can be supported. We develop PFQ with deterministic time-varying weight assignments, and we propose a low-overhead algorithm capable of supporting arbitrary piecewise linear service curves which achieve delay-bandwidth decoupling. Unlike existing service-curve based algorithms, our time-varying PFQ scheme does not exhibit the punishment phenomenon, and allows sessions to exploit the extra bandwidth in under-loaded networks.
منابع مشابه
Start-time Fair Queuing: A Scheduling Algorithm for Integrated Services Packet Switching Networks
We present Start-time Fair Queuing (SFQ) algorithm that is computationally efficient, achieves fairness regardless of variation in a server capacity, and has the smallest fairness measure among all known fair scheduling algorithms. We analyze its throughput, single server delay, and end-to-end delay guarantee for variable rate Fluctuation Constrained (FC) and Exponentially Bounded Fluctuation (...
متن کاملLLQ in Integrated Services Networks
Integrated services networks integrate wide variety of services, such as voices, video, and data, onto a common infrastructure. There are however major obstacles to overcome, since different services not only have drastically different traffic characteristics, but also extremely diverse Quality of Service (QoS) requirements expressed in terms of delay, jitter, throughput and loss rate. An impor...
متن کاملSoft-qos Provisioning Using the Token Bank Fair Queueing Scheduling Algorithm
Future generation wireless packet networks will support multimedia applications with diverse quality-of-service (QoS) requirements. Much of the research on scheduling algorithms has been focused on hard QoS provisioning of integrated services. Although these algorithms give hard delay bounds, their stringent requirements sacrifice the potential statistical multiplexing performance and flexibili...
متن کاملParallel Switching in Connection-Oriented Networks
Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An e cient packet-scheduling algorithm that guarantees a deterministic quality of service to connections with real-time constraints is proposed { this algorithm is a generalization of some recent multiprocessor scheduling algorithms, and o ers realtime performance guar...
متن کاملWhy WFQ Is Not Good Enough For Integrated Services Networks
Weighted Fair Queueing has received a lot of attention in the research community recently. In fact, the IETF has proposed to use WFQ as a basic building block for future integrated services networks. The reason for such a great interest is that it closely approximates a hypothetical uid model discipline called Generalized Processor Sharing (GPS), which provides a conceptually ideal building blo...
متن کامل